Minimum-Complexity Failure Correction in Linear Arrays via Compressive Processing

Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that properties original pattern can be recovered. Unlike several FC techniques available in literature, which update all excitations, Minimum-Complexity Failure Correction (MCFC) problem is addressed this paper. By properly reformulating problem, minimum number corrections whole excitations determined by means innovative Compressive Processing (CP) technique order to afford as close possible one (i.e., without failures). Selected examples, from wide numerical test cases, are discussed assess effectiveness proposed approach well compare its performance other competitive state-of-the-art terms both features and corrections.